Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems

Improved Harmony Search with Chaos for Solving Linear Assignment Problems

This paper presents an improved version of a harmony meta-heuristic algorithm, (IHSCH), for solving the linear assignment problem. The proposed algorithm uses chaotic behavior to generation a candidate solution in a behavior similar to acoustic monophony. Nume rical results show that the IHSCH is able to obtain the optimal results in comparison with tradit ional methods (the Hungarian method). ...

EFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS

Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...

Gravitational Search Algorithm with Chaotic Map (gsa-cm) for Solving Optimization Problems

Gravitational Search Algorithm (GSA) is a newly heuristic algorithm inspired by nature which utilizes Newtonian gravity law and mass interactions. It has captured much attention since it has provided higher performance in solving various optimization problems. This study hybridizes the GSA and chaotic equations. Ten chaotic-based GSA (GSA-CM) methods, which define the random selections by diffe...

A Hybrid Harmony Search Algorithm for Solving Dynamic Optimisation Problems

Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to seek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one o...

Chaotic optimization for quadratic assignment problems